Truthful Mechanisms for Generalized Utilitarian Problems
نویسندگان
چکیده
In this paper we investigate extensions of the well-known Vickrey[1961]-Clarke[1971]Groves[1973] (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents’ utilities are not quasi-linear. We provide a generalization of utilitarian problems, termed consistent problems, and prove that every consistent problem admits a truthful mechanism. These mechanisms, termed VCG-consistent mechanisms, can be seen as a natural extension of VCG mechanisms for utilitarian problems. We then investigate extensions/restrictions of consistent problems. This yields three classes of problems for which (i) VCG-consistent mechanisms are the only truthful mechanisms, (ii) no truthful VCG-consistent mechanism exists, and (iii) no truthful mechanism exists, respectively. Showing that a given problem is in one of these three classes is straightforward, thus yielding a simple way to see whether VCG-consistent mechanisms are appropriate or not. Finally, we apply our results to a number of basic non-utilitarian problems.
منابع مشابه
Improved Lower Bounds for Non-utilitarian Truthfulness
One of the most fundamental results in the field of mechanism design states that every utilitarian social choice function admits a mechanism that truthfully implements it. In stark contrast with this finding, when one considers a non-utilitarian social choice function, it turns out that no guarantees can be made, i.e. there are non-utilitarian functions, which cannot be truthfully implemented. ...
متن کاملNo truthful mechanism can be better than n approximate for two natural problems
This work gives the first natural non-utilitarian problems for which the trivial n approximation via VCG mechanisms is the best possible. That is, no truthful mechanism can be better than n approximate, where n is the number of agents. The problems are the min-max variant of shortest path and (directed) minimum spanning tree mechanism design problems. In these procurement auctions, agents own t...
متن کاملAlmost-truthful Mechanisms for Fair Social Choice Functions
This paper deals with the implementation of Social Choice Functions in fair multiagent decision problems. In such problems the determination of the best alternatives often relies on the maximization of a non-utilitarian Social Welfare Function so as to account for equity. However, in such decision processes, agents may have incentive to misreport their preferences to obtain more favorable choic...
متن کاملHeterogeneous Facility Location without Money: (Doctoral Consortium)
The facility location problem is arguably the prototypical problem in the mechanism design without money’s research agenda. Motivated by the intrinsic limitations of the classical model on both (i) adequately modelling several real life scenarios and (ii) admitting truthful mechanisms having good approximation ratio, we introduce and study a novel, more realistic model of facility location, whe...
متن کاملStrongly Polynomial-Time Truthful Mechanisms in One Shot
One of the main challenges in algorithmic mechanism design is to turn (existing) efficient algorithmic solutions into efficient truthful mechanisms. Building a truthful mechanism is indeed a difficult process since the underlying algorithm must obey certain “monotonicity” properties and suitable payment functions need to be computed (this task usually represents the bottleneck in the overall ti...
متن کامل